منابع مشابه
Minimum Cost Homomorphism Dichotomy for Oriented Cycles
For digraphs D and H , a mapping f : V (D)→V (H) is a homomorphism of D to H if uv ∈ A(D) implies f (u) f (v) ∈ A(H). If, moreover, each vertex u ∈ V (D) is associated with costs ci (u), i ∈ V (H), then the cost of the homomorphism f is ∑ u∈V (D) c f (u)(u). For each fixed digraph H , we have the minimum cost homomorphism problem for H (abbreviated MinHOM(H )). The problem is to decide, for an ...
متن کاملGraph homomorphism into an odd cycle
For graphs G and H, a map f : V (G) 7→ V (H) is a homomorphism if f preserves adjacency. Let Hom(G,H) denote the set of all homomorphisms from G into H. In this paper, we proved that for a simple graph G with n = |V (G)| and for k with n ≥ k ≥ 5, if the odd girth of G is at least 2k+1 and if the minimum degree δ(G) > 2n/(2k+3), then Hom(G,Z2k+1) 6= ∅, where Z2k+1 denotes the cycle of length 2k ...
متن کاملExtremal Graph for Intersecting Odd Cycles
An extremal graph for a graph H on n vertices is a graph on n vertices with maximum number of edges that does not contain H as a subgraph. Let Tn,r be the Turán graph, which is the complete r-partite graph on n vertices with part sizes that differ by at most one. The well-known Turán Theorem states that Tn,r is the only extremal graph for complete graph Kr+1. Erdős et al. (1995) determined the ...
متن کاملA multipartite Ramsey number for odd cycles
In this paper we study multipartite Ramsey numbers for odd cycles. Our main result is the proof of a conjecture of Gyárfás, Sárközy and Schelp [12]. Precisely, let n ≥ 5 be an arbitrary positive odd integer; then in any two-coloring of the edges of the complete 5-partite graph K(n−1)/2,(n−1)/2,(n−1)/2,(n−1)/2,1 there is a monochromatic cycle of length n. keywords: cycles, Ramsey number, Regular...
متن کاملMultipartite Ramsey numbers for odd cycles
In this paper we study multipartite Ramsey numbers for odd cycles. We formulate the following conjecture: Let n ≥ 5 be an arbitrary positive odd integer; then, in any two-coloring of the edges of the complete 5-partite graph K((n − 1)/2, (n − 1)/2, (n − 1)/2, (n − 1)/2, 1) there is a monochromatic Cn, ∗2000 Mathematics Subject Classification: 05C55, 05C38. †Research supported in part by the Nat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorica
سال: 2020
ISSN: 0209-9683,1439-6912
DOI: 10.1007/s00493-019-3920-8